A General Pairwise Comparison Model for Extremely Sparse Networks

نویسندگان

چکیده

Statistical estimation using pairwise comparison data is an effective approach to analyzing large-scale sparse networks. In this article, we propose a general framework model the mutual interactions in network, which enjoys ample flexibility terms of parameterization. Under setup, show that maximum likelihood estimator for latent score vector subjects uniformly consistent under near-minimal condition on network sparsity. This sharp leading order asymptotics describing Our analysis uses novel chaining technique and illustrates important connection between graph topology consistency. results guarantee justified networks where are asymptotically deficient. Simulation studies provided support our theoretical findings. Supplementary materials article available online.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A general unified framework for interval pairwise comparison matrices

Interval Pairwise Comparison Matrices have been widely used to account for uncertain statements concerning the preferences of decision makers. Several approaches have been proposed in the literature, such as multiplicative and fuzzy interval matrices. In this paper, we propose a general unified approach to Interval Pairwise Comparison Matrices, based on Abelian linearly ordered groups. In this ...

متن کامل

Deriving weights from general pairwise comparison matrices

The problem of deriving weights from pairwise comparison matrices has been treated extensively in the literature. Most of the results are devoted to the case when the matrix under consideration is reciprocally symmetric (i.e., the i, j-th element of the matrix is reciprocal to its j, i-th element for each i and j). However, there are some applications of the framework when the underlying matric...

متن کامل

Estimation of Sparse Binary Pairwise Markov Networks using Pseudo-likelihoods

We consider the problems of estimating the parameters as well as the structure of binary-valued Markov networks. For maximizing the penalized log-likelihood, we implement an approximate procedure based on the pseudo-likelihood of Besag (1975) and generalize it to a fast exact algorithm. The exact algorithm starts with the pseudo-likelihood solution and then adjusts the pseudo-likelihood criteri...

متن کامل

GenericDiff: A General Framework for Model Comparison

This paper presents GenericDiff, a general framework for model comparison. The main design challenge of GenericDiff lies in how to strike a balance between being domain independent yet aware of domain-specific model properties and syntax. GenericDiff tackles this challenge by separating the specification of domainspecific inputs from the generic graph matching process and by making use of two d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 2022

ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']

DOI: https://doi.org/10.1080/01621459.2022.2053137